Constrained Sampling Using Simulated Annealing
نویسندگان
چکیده
Scientific image processing involves a variety of problems including image modeling, reconstruction, and synthesis. In this paper we develop a constrained sampling approach for porous media synthesis and reconstruction in order to generate artificial samples of porous media. Our approach is different from current porous media reconstruction methods in which the Gibbs probability distribution is maximized by simulated annealing. We show that the artificial images generated by those methods do not contain the variability that typical samples of random fields are required to have.
منابع مشابه
Tuning Strategies in Constrained Simulated Annealing for Nonlinear Global Optimization
This paper studies various strategies in constrained simulated annealing (CSA), a global optimization algorithm that achieves asymptotic convergence to constrained global minima (CGM) with probability one for solving discrete constrained nonlinear programming problems (NLPs). The algorithm is based on the necessary and suucient condition for discrete constrained local minima (CLM) in the theory...
متن کاملOptimizing Programmable Logic Arrays Using the Simulated Annealing Algorithm
In the paper the programmable logic array (PLA) topological optimization problem is dealt with using folding techniques. A PLA folding algorithm based on the method of simulated annealing is presented. A simulated-annealing PLA folding algorithm is presented for multiple unconstrained folding. Then, the algorithm is extended to handle constrained folding. In this way, simple folding is consider...
متن کاملAn Application of Simulated Annealing to the Optimum Design of Reinforced Concrete Retaining Structures
This paper reports on the application of a simulated annealing algorithm to the minimum cost design of reinforced concrete retaining structures. Cantilever retaining walls are investigated, being representative of reinforced concrete retaining structures that are required to resist a combination of earth and hydrostatic loading. To solve such a constrained optimisation problem, a modified simul...
متن کاملNested Sampling for General Bayesian Computation
Nested sampling estimates directly how the likelihood function relates to prior mass. The evidence (alternatively the marginal likelihood, marginal density of the data, or the prior predictive) is immediately obtained by summation. It is the prime result of the computation, and is accompanied by an estimate of numerical uncertainty. Samples from the posterior distribution are an optional byprod...
متن کاملConstrained Multi-global Optimization using a Penalty Stretched Simulated Annealing Framework
This paper presents a new simulated annealing algorithm to solve constrained multi-global optimization problems. To compute all global solutions in a sequential manner, we combine the function stretching technique with the adaptive simulated annealing variant. Constraint-handling is carried out through a nondifferentiable penalty function. To benchmark our penalty stretched simulated annealing ...
متن کامل